Generating Maps Using Markov Chains
نویسندگان
چکیده
In this paper we outline a method of procedurally generating maps using Markov Chains. Our method attempts to learn what makes a “good” map from a set of given human-authored maps, and then uses those learned patterns to generate new maps. We present an empirical evaluation using the game Super Mario Bros., showing encouraging results.
منابع مشابه
A Hierarchical Approach to Generating Maps Using Markov Chains
In this paper we describe a hierarchical method for procedurally generating maps using Markov chains. Our method takes as input a collection of human-authored two-dimensional maps, and splits them into high-level tiles which capture large structures. Markov chains are then learned from those maps to capture the structure of both the high-level tiles, as well as the low-level tiles. Then, the le...
متن کاملExperiments in map generation using Markov chains
In this paper we describe a method of procedurally generating maps using Markov chains. This method learns statistical patterns from human-authored maps, which are assumed to be of high quality. Our method then uses those learned patterns to generate new maps. We present a collection of strategies both for training the Markov chains, and for generating maps from such Markov chains. We then vali...
متن کامل2D Spatial Distributions for Measures of Random Sequences Using Conjugate Maps
Advanced visual tools are useful to provide additional information for modern information warfare. 2D spatial distributions of random sequences play an important role to understand properties of complex sequences. This paper proposes time-sequences from a given logical function of 1D Cellular Automata in both Poincare map and conjugate map. Multiple measure sequences of Markov chains can be use...
متن کاملControllable Procedural Content Generation via Constrained Multi-Dimensional Markov Chain Sampling
Statistical models, such as Markov chains, have recently started to be studied for the purpose of Procedural Content Generation (PCG). A major problem with this approach is controlling the sampling process in order to obtain output satisfying some desired constraints. In this paper we present three approaches to constraining the content generated using multi-dimensional Markov chains: (1) a gen...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کامل